Resource Competition on Integral Polymatroids
نویسندگان
چکیده
We study competitive resource allocation problems in which players distribute their demands integrally on a set of resources subject to player-specific submodular capacity constraints. Each player has to pay for each unit of demand a cost that is a nondecreasing and convex function of the total allocation of that resource. This general model of resource allocation generalizes both singleton congestion games with integer-splittable demands and matroid congestion games with playerspecific costs. As our main result, we show that in such general resource allocation problems a pure Nash equilibrium is guaranteed to exist by giving a pseudo-polynomial algorithm computing a pure Nash equilibrium.
منابع مشابه
Discrete Polymatroids
The discrete polymatroid is a multiset analogue of the matroid. Based on the polyhedral theory on integral polymatroids developed in late 1960’s and in early 1970’s, in the present paper the combinatorics and algebra on discrete polymatroids will be studied.
متن کاملCharacterizing and recognizing generalized polymatroids
Generalized polymatroids are a family of polyhedra with several nice properties and applications. One property of generalized polymatroids used widely in existing literature is “total dual laminarity;” we make this notion explicit and show that only generalized polymatroids have this property. Using this we give a polynomial-time algorithm to check whether a given linear program defines a gener...
متن کاملLinear spaces, transversal polymatroids and ASL domains
We study a class of algebras associated with linear spaces and its relations with polymatroids and integral posets, i.e. posets supporting homogeneous ASL. We prove that the base ring of a transversal polymatroid is Koszul and describe a new class of integral posets. As a corollary we obtain that every Veronese subring of a polynomial ring is an ASL.
متن کاملNeighbor Systems and the Greedy Algorithm ( Extended
A neighbor system, introduced in this paper, is a collection of integral vectors in R with some special structure. Such collections (slightly) generalize jump systems, which, in turn, generalize integral bisubmodular polyhedra, integral polymatroids, delta-matroids, matroids, and other structures. We show that neighbor systems provide a systematic and simple way to characterize these structures...
متن کاملQuasi Polymatroidal Flow Networks
In this paper we give a flow model on directed multigraphs by introducing reflexions of generalized polymatroids at vertices as constraints for the flow conservation. This model has the essential features of the classical flow model, primarily the max-flow min-cut theorem and the polynomial algorithm for computing the maximal feasible (integral) flow.
متن کامل